A geometric non-existence proof of an extremal additive code
نویسندگان
چکیده
منابع مشابه
A geometric non-existence proof of an extremal additive code
We use a geometric approach to solve an extremal problem in coding theory. Expressed in geometric language we show the nonexistence of a system of 12 lines in PG(8, 2) with the property that no hyperplane contains more than 5 of the lines. In coding-theoretic terms this is equivalent with the non-existence of an additive quaternary code of length 12, binary dimension 9 and minimum distance 7.
متن کاملA Geometric Proof of the Existence of the Green Bundles
We give a new proof of the existence of the Green bundles. Let (M, g) be a compact Riemannian manifold, and denote by gt its geodesic flow on the tangent bundle TM . Let π : TM → M be the canonical projection and for all θ ∈ TM let V (θ) be the kernel of dπθ. Two points θ1, θ2 are said to be conjugate if θ2 = gtθ1 and dgtV (θ1) ∩ V (θ2) 6= 0. It was proved by Hopf [5] that a two-dimensional tor...
متن کاملA Geometric Proof of the Existence of Whitney Stratifications
A stratification of a set, e.g. an analytic variety, is, roughly, a partition of it into manifolds so that these manifolds fit together “regularly”. Stratification theory was originated by Thom and Whitney for algebraic and analytic sets. It was one of the key ingredients in Mather’s proof of the topological stability theorem [Ma] (see [GM] and [PW] for the history and further applications of s...
متن کاملUpdating non-additive probabilities - a geometric approach
A geometric approach, analogous to the approach used in the additive case, is proposed to determine the conditional expectation with non-additive probabilities. The conditional expectation is then applied for (i) updating the probability when new information becomes available; and (ii) defining the notion of independence of non-additive probabilities and Nash equilibrium. Journal of Economic Li...
متن کاملExtremal Problems for Geometric Hypergraphs 1 Extremal Problems for Geometric
A geometric hypergraph H is a collection of i-dimensional simplices, called hyperedges or, simply, edges, induced by some (i + 1)-tuples of a vertex set V in general position in d-space. The topological structure of geometric graphs, i.e., the case d = 2; i = 1, has been studied extensively, and it proved to be instrumental for the solution of a wide range of problems in combinatorial and compu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 2010
ISSN: 0097-3165
DOI: 10.1016/j.jcta.2009.04.005